Block Fsai Performance with Graph Partitioning in Large Size Subsurface Problems
نویسندگان
چکیده
Adaptive Block FSAI (ABF) is a novel and promising preconditioner for the efficient parallel solution of linear systems and eigenproblems arising from subsurface applications. However, one of its main drawbacks stems from the reduced scalability, as the iteration count to converge tends to grow increasing the number of processors. Graph partitioning techniques can help improve both the preconditioner performance and scalability. Different algorithms are experimented with in a test problem arising from a groundwater flow application. The results show that coupling graph partitioning with ABF appears to be an important factor to increase significantly the preconditioner efficiency, allowing for its effective use also on massively parallel simulations.
منابع مشابه
Parallel Rayleigh Quotient Optimization with FSAI-Based Preconditioning
The present paper describes a parallel preconditioned algorithm for the solution of partial eigenvalue problems for large sparse symmetric matrices, on parallel computers. Namely, we consider the Deflation-Accelerated Conjugate Gradient (DACG) algorithm accelerated by factorized sparse approximate inverse (FSAI) type preconditioners. We present an enhanced parallel implementation of the FSAI pr...
متن کاملA numerical experimental study of inverse preconditioning for the parallel iterative solution to 3D finite element flow equations
Integration of the subsurface flow equation by finite elements (FE) in space and finite differences (FD) in time requires the repeated solution to sparse symmetric positive definite systems of linear equations. Iterative techniques based on preconditioned conjugate gradients (PCG) are one of the most attractive tool to solve the problem on sequential computers.A present challenge is to make PCG...
متن کاملParallel Inexact Constraint Preconditioners for Saddle Point Problems
In this paper we propose a parallel implementation of the FSAI preconditioner to accelerate the PCG method in the solution of symmetric positive definite linear systems of very large size. This preconditioner is used as building block for the construction of an indefinite Inexact Constraint Preconditioner (ICP) for saddle point-type linear systems arising from Finite Element (FE) discretization...
متن کاملMatrix Ordering Strategies for Process Engineering: Graph Partitioning Algorithms for Parallel Computation
The solution of large-scale chemical process simulation and optimization problems using parallel computation requires algorithms that can take advantage of multiprocessing when solving the large, sparse matrices that arise. Parallel algorithms require that the matrices be partitioned in order to distribute computational work across processors. One way to accomplish this is to reorder the matrix...
متن کاملPartitioning for Fpga Circuits
In computer-aided design, partitioning is the task of clustering objects into groups so that a given objective function is optimized with respect to a set of design constraints. Partitioning is used frequently in physical design; for example, at the layout level it is used to find strongly connected components that can be placed together in order to minimize the layout area and propagation dela...
متن کامل